Optimal resource allocation for multiclass services in peer-to-peer networks via successive approximation

Peer-to-peer (P2P) networks support a wide variety of network services including elastic such as file-sharing and downloading inelastic real-time multiparty conferencing. Each peer who acquires service will receive certain level satisfaction if the is provided with amount resource. The utility function used to describe when acquiring service. In this paper we consider optimal resource allocation for formulate maximization model which an intractable difficult non-convex optimization problem. order resolve it, apply successive approximation method approximate problem serial equivalent convex problems. Then develop gradient-based scheme achieve solutions approximations. After approximations, proposed can finally converge solution primal satisfies Karush–Kuhn–Tucker conditions.